Parallel Preconditioners for B Urgers
نویسندگان
چکیده
منابع مشابه
Some Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...
متن کاملPerformance evaluation of a new parallel preconditioner
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices associated with these linear systems are symmetric and positive definite, the systems are often solved iteratively using the preconditioned conjugate gradient method. We have developed a new class of p...
متن کاملIncomplete Inverse Preconditioners
Incomplete LU factorization is a valuable preconditioning approach for sparse iterative solvers. An “ideal” but inefficient preconditioner for the iterative solution of Ax = b is A−1 itself. This paper describes a preconditioner based on sparse approximations to partitioned representations of A−1, in addition to the results of implementation of the proposed method in a shared memory parallel en...
متن کاملDesign of a Library of Parallel Preconditioners
We outline the design principles underlying the ParPre library of parallel preconditioners. ParPre is a message passing library of distributed preconditioners for linear systems, written using MPI and Petsc. It comprises Schwarz methods, Schur system domain decompositioning, various parallel incomplete factorisations, and multilevel methods.
متن کاملMultipole-based preconditioners for large sparse linear systems
Dense operators for preconditioning sparse linear systems have traditionally been considered infeasible due to their excessive computational and memory requirements. With the emergence of techniques such as block low-rank approximations and hierarchical multipole approximations, the cost of computing and storing these preconditioners has reduced dramatically. This paper describes the use of mul...
متن کامل